Learning of robust spectral graph dictionaries for distributed processing
نویسندگان
چکیده
منابع مشابه
Learning of Graph Compressed Dictionaries for Sparse Representation Classification
Despite the limited target data available to design face models in video surveillance applications, many faces of non-target individuals may be captured in operational environments, and over multiple cameras, to improve robustness to variations. This paper focuses on Sparse Representation Classification (SRC) techniques that are suitable for the design of still-to-video FR systems based on unde...
متن کاملLearning spectral graph segmentation
We present a general graph learning algorithm for spectral graph partitioning, that allows direct supervised learning of graph structures using hand labeled training examples. The learning algorithm is based on gradient descent in the space of all feasible graph weights. Computation of the gradient involves finding the derivatives of eigenvectors with respect to the graph weight matrix. We show...
متن کاملDistributed Machine Learning and Graph Processing with Sparse Matrices
It is cumbersome to write machine learning and graph algorithms in data-parallel models such as MapReduce and Dryad. We observe that these algorithms are based on matrix computations and, hence, are inefficient to implement with the restrictive programming and communication interface of such frameworks. In this paper we show that array-based languages such as R [2] are suitable for implementing...
متن کاملSpectral learning of graph distributions
This work draws on previous works regarding spectral learning algorithm for structured data (see [5], [9], [2], [1], [8]). We present an extension of the Hidden Markov Models, called Graphical Weighted Models (GWM), whose purpose is to model distributions over labeled graphs. We describe the spectral algorithm for GWM, which generalizes the previous spectral algorithms for sequences and trees. ...
متن کاملDistributed Edge Partitioning for Graph Processing
The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased. Appropriately partitioning the graph as a preprocessing step can improve the degree of parallelism of its analysis. A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2018
ISSN: 1687-6180
DOI: 10.1186/s13634-018-0584-2